منابع مشابه
A Random Walk on Image Patches
In this paper we address the problem of understanding the success of algorithms that organize patches according to graph-based metrics. Algorithms that analyze patches extracted from images or time series have led to state-of-the art techniques for classification, denoising, and the study of nonlinear dynamics. The main contribution of this work is to provide a theoretical explanation for the a...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملEnsembles on Random Patches
Table 1: Accuracy on small datasets (in %). Validation RF ET P-DT P-ET RS-DT RS-ET RP-DT RP-ET diabetes 77.12 (6) 77.25 (5) 77.67 (4) 78.01 (3) 75.11 (8) 76.77 (7) 78.82 (2) 79.07 (1) dig44 94.99 (7) 95.78 (1) 91.86 (8) 95.46 (4) 95.07 (6) 95.69 (3) 95.13 (5) 95.72 (2) ionosphere 94.40 (6) 95.15 (3) 93.86 (8) 94.75 (5) 94.11 (7) 94.90 (4) 95.20 (2) 95.36 (1) pendigits 98.94 (7) 99.33 (1) 98.09 ...
متن کاملRandom walk on random walks
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density ρ ∈ (0,∞). At each step the random walk performs a nearest-neighbour jump, moving to the right with probability p◦ when it is on a vacant site and probability p• when it is on an oc...
متن کاملRandom walk on a polygon
Abstract: A particle moves among the vertices of an (m + 1)-gon which are labeled clockwise as 0, 1, . . . , m. The particle starts at 0 and thereafter at each step it moves to the adjacent vertex, going clockwise with a known probability p, or counterclockwise with probability 1 − p. The directions of successive movements are independent. What is the expected number of moves needed to visit al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Imaging Sciences
سال: 2012
ISSN: 1936-4954
DOI: 10.1137/110839370